Uncertainty in Soft Constraint Problems
نویسندگان
چکیده
Preferences and uncertainty occur in many real-life problems. We are concerned with the coexistence of preference and uncertainty in the same problem. In particular, we consider uncertainty, defined by the theory of possibility [2], that is one non-probabilistic way of dealing with uncertainty, that comes from lack of data or imprecise knowledge. We propose a method to integrate fuzzy preferences and uncertainty [3], which follows the approach in [2] and allows one to handle uncertainty within a fuzzy optimization engine, which at the same time observing separately the preference and the robustness of complete instantiations. To order the complete instantiations, we define three semantics, which correspond to the attitude to the risk. We generalize this method in [4] to deal also with other classes of preferences such as probabilistic or weighted constraints [1], and also probabilistic uncertainty. In particular, probabilistic constraints are very useful for modelling real-life scenarios where fuzzy constraints are not the ideal setting, because combining preferences multiplying them is better than taking their minimum value. Weighted constraints are useful to model problems where preferences are penalties (or costs) to be added, and where the best preferences are the smallest ones. We plan to develop a solver that can handle problems with several classes of soft constraints, together with uncertainty expressed via possibility or probability distributions. The solver will be able to generate solution orderings according the our semantics as well as others that we will define by following different optimistic or pessimistic approaches. We also plan to develop techniques for reasoning with uncertainty in problems with both positive and negative preferences.
منابع مشابه
Modelling Soft Constraints: A Survey
Constraint programming is an approach for solving (mostly combinatorial) problems by stating constraints over the problem variables. In some problems, there is no solution satisfying all the constraints or the problem formulation must deal with uncertainty, vagueness, or imprecision. In such a case the standard constraint satisfaction techniques dealing with hard constraints cannot be used dire...
متن کاملImprecise Soft Constraint Problems
We define interval-valued soft constraints, where users can associate an interval of preference values, rather than a single value, to each instantiation of the variables of the constraints. This allows us to model a form of uncertainty and imprecision that is often found in real-life problems. We then define several notions of optimal solutions for such problems, providing algorithms to find o...
متن کاملEvaluation-Based Semiring Meta-constraints
Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be restrictive in situations where uncertainty, fuzziness, probability or optimisation are intrinsic. Soft constraints alleviate many of the restrictions which classical constraint satisfaction impose; in particular, soft constra...
متن کاملMulti-objective scheduling and assembly line balancing with resource constraint and cost uncertainty: A “box” set robust optimization
Assembly lines are flow-oriented production systems that are of great importance in the industrial production of standard, high-volume products and even more recently, they have become commonplace in producing low-volume custom products. The main goal of designers of these lines is to increase the efficiency of the system and therefore, the assembly line balancing to achieve an optimal system i...
متن کاملSimple Temporal Problems with Preferences and Uncertainty
Simple Temporal Problems (STPs) are a restriction of the framework of Temporal Constraint Satisfaction Problems, tractable in polynomial time. Their expressiveness has been extended independently in two ways. First, to account for uncontrollable events, to Simple Temporal Problems with Uncertainty (STPUs). Second, more recently, to account for soft temporal preferences, to Simple Temporal Probl...
متن کاملEvaluating the Effectiveness of Integrated Benders Decomposition Algorithm and Epsilon Constraint Method for Multi-Objective Facility Location Problem under Demand Uncertainty
One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. For this aim, a multi-objective facility location allocation model is proposed. In this case, an integrated BDA and epsilon constraint method are proposed and it is shown that how P...
متن کامل